On the Number of Predecessors in Constrained Random Mappings
نویسنده
چکیده
We consider random mappings from an n–element set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and singularity analysis.
منابع مشابه
The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملPredecessors and Successors in Random Mappings with Exchangeable In-Degrees
In this paper we characterise the distributions of the number of predecessors and of the number of successors of given set of vertices, A, in the random mapping model, T D̂ n , (see [10]) with exchangeable in-degree sequence (D̂1, D̂2, ..., D̂n). We show that the exact formulas for these distributions and their expected values can be given in terms of the distributions of simple functions of the in...
متن کاملImages and Preimages in Random Mappings
We present a general theorem that can be used to identify the limiting distribution for a class of combinatorial schemata. For example, many parameters in random mappings can be covered in this way. In particular, we can derive the limiting distribution of those points with a given number of total predecessors.
متن کاملDATA ENVELOPMENT ANALYSIS WITH FUZZY RANDOM INPUTS AND OUTPUTS: A CHANCE-CONSTRAINED PROGRAMMING APPROACH
In this paper, we deal with fuzzy random variables for inputs andoutputs in Data Envelopment Analysis (DEA). These variables are considered as fuzzyrandom flat LR numbers with known distribution. The problem is to find a method forconverting the imprecise chance-constrained DEA model into a crisp one. This can bedone by first, defuzzification of imprecise probability by constructing a suitablem...
متن کاملRandom mappings with exchangeable in-degrees
A random mapping T D̂ n maps the set {1, 2, ..., n} into itself and it is constructed using a collection of exchangeable random variables D̂1, ...., D̂n which satisfy ∑n i=1 D̂i = n. In the random digraph, G D̂ n , which represents the mapping T D̂ n , the in-degree sequence for the vertices is given by the variables D̂1, D̂2, ..., D̂n and, in some sense, Gn can be viewed as an analogue of the general i...
متن کامل